PÓLYA'S COMBINATORIAL METHOD AND THE ISOMER ENUMERATION PROBLEM
نویسندگان
چکیده
منابع مشابه
Combinatorial method in the coset enumeration of symmetrically generated groups
We give an algorithm for enumerating cosets of a group defined as a finite homomorphic image of a semi-direct product of free products of cyclic groups by a group of monomial automorphisms. Lots of finite groups, including some of the sporadic simple groups can be defined in this mannar. Mathematics Subject Classification: 20Bxx
متن کاملCombinatorial Polytope Enumeration
We describe a provably complete algorithm for the generation of a tight, possibly exact, superset of all combinatorially distinct simple n-facet polytopes in Rd, along with their graphs, f -vectors, and face lattices. The technique applies repeated cutting planes and planar sweeps to a d−simplex. Our generator has implications for several outstanding problems in polytope theory, including conje...
متن کاملThe Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملFast Enumeration of Combinatorial Objects
The problem of ranking (or perfect hashing) is well known in Combinatorial Analysis, Computer Science, and Information Theory. There are widely used methods for ranking permutations of numbers {1, 2, ..., n}, n ≥ 1, for ranking binary words of length n with a fixed number of ones and for many other combinatorial problems. Many of these methods have nonexponential memory size and the time of enu...
متن کاملRational and algebraic series in combinatorial enumeration
Let A be a class of objects, equipped with an integer size such that for all n the number an of objects of size n is finite. We are interested in the case where the generating function ∑ n ant n is rational, or more generally algebraic. This property has a practical interest, since one can usually say a lot on the numbers an, but also a combinatorial one: the rational or algebraic nature of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Boletín de la Sociedad Chilena de Química
سال: 2002
ISSN: 0366-1644
DOI: 10.4067/s0366-16442002000200006